A Break-Even Formulation for Evaluating Branch Predictor Energy Efficiency
نویسندگان
چکیده
Recent work has demonstrated that a better branch predictor can increase the energy-efficiency of the system, even if the new predictor consumes more energy. Consequently, understanding the tradeoff between reduced misspeculation, execution time, and increased power spent within a branch predictor is critical. This paper proposes a simple, effective metric for evaluating the tradeoff between processor energy-efficiency and branch predictor energy. By calculating a break-even branch predictor energy budget for a given program and an energy-efficiency target, we are able to evaluate the energy-efficiency of several existing branch predictor designs and provide a simple way to think about energyefficiency. Furthermore, we develop a method for deriving a branch predictor energy budget without requiring a power model for the proposed branch predictor. We evaluate this approach by comparing the budgets we calculate with results from simulation. Average error in our estimates is less than 1.5% for all pipeline configurations with a confidence of ±0.02 to ±0.06 Joules (1.7%-2.1%) for the integer benchmarks and ±0.01 to ±0.02 Joules (1.1%-1.7%) for the floating point benchmarks for the evaluated configurations.
منابع مشابه
Potential for Branch Predictor Adaptation at the Program and Phase Level for Performance and Energy-Efficiency
Experiments to determine the potential for program-level and/or phase-level adaptation of branch predictor configuration for the purpose of total processor energy savings were performed. The performance and energyefficiency of an 8-wide issue, out-of-order processor with six different branch predictors were evaluated on the SPECcpu2000 benchmark suite. Each branch predictor was compared to the ...
متن کاملStop talking to me - a communication-avoiding ADER-DG realisation
We present a communicationand data-sensitive formulation of ADER-DG for hyperbolic differential equation systems. Sensitive here has multiple flavours: First, the formulation reduces the persistent memory footprint. This reduces pressure on the memory subsystem. Second, the formulation realises the underlying predictor-corrector scheme with single-touch semantics, i.e. each degree of freedom is...
متن کاملBranch Path Re-Aliasing
Deeper pipelines improve overall performance by allowing more aggressive clock rates, but some performance is lost due to increased branch misprediction penalties. Ironically, with shorter clock periods, the branch predictor has less time to make a prediction and might have to be scaled back to make it faster, which decreases accuracy and reduces the advantage of higher clock rates. We show how...
متن کاملA Modified Directional Distance Formulation of DEA with Malmquist Index to Assess Bankruptcy
Bankruptcy in the same amount of time and history is very rampant and therefore the vision of the future can be prevented. Using data envelopment analysis (DEA) and malmquist index can precise evaluating of the performances of many different kinds of decision making units (DMU) such as hospitals, universities, business firms, etc. In this paper, we will modify directional distance formulation o...
متن کاملReconsidering Complex Branch Predictors
To sustain instruction throughput rates in more aggressively clocked microarchitectures, microarchitects have incorporated larger and more complex branch predictors into their designs, taking advantage of the increasing numbers of transistors available on a chip. Unfortunately, because of penalties associated with their implementations, the extra accuracy provided by many branch predictors does...
متن کامل